A Jacobi Algorithm and Metric Theory for Greatest Common
نویسنده
چکیده
Greatest common divisor algorithms are used to provide a natural motivation for considering a class of Jacobi-Perron algorithms which includes the original Jacobi algorithm. This work proves convergence and establishes metric properties for one of these algorithms. The proofs generalize to the larger class of algorithms. Full connections with the calculation of greatest common divisors will be treated elsewhere.
منابع مشابه
Computational Number Theory and Applications to Cryptography
• Greatest common divisor (GCD) algorithms. We begin with Euclid’s algorithm, and the extended Euclidean algorithm [2, 12]. We will then discuss variations and improvements such as Lehmer’s algorithm [14], the binary algorithms [12], generalized binary algorithms [20], and FFT-based methods. We will also discuss how to adapt GCD algorithms to compute modular inverses and to compute the Jacobi a...
متن کاملMultidimensional Greatest Common Divisor and Lehmer Algorithms
A class of multidimensional greatest common divisor algorithms is studied. Their connection with the Jacobi algorithm is established and used to obtain theoretical properties such as the existence of digit frequencies. A technique of D. H. Lehmer's for Euclid's algorithm is generalized for efficient computation of the multidimensional algorithms. For triples of integers, two algorithms of inter...
متن کاملCommon Fixed Point Theorems for Weakly Compatible Mappings by (CLR) Property on Partial Metric Space
The purpose of this paper is to obtain the common fixed point results for two pair of weakly compatible mapping by using common (CLR) property in partial metric space. Also we extend the very recent results which are presented in [17, Muhammad Sarwar, Mian Bahadur Zada and Inci M. Erhan, Common Fixed Point Theorems of Integral type on Metric Spaces and application to system of functional equat...
متن کاملCourse 311: Michaelmas Term 2005 Part I: Topics in Number Theory
1 Topics in Number Theory 2 1.1 Subgroups of the Integers . . . . . . . . . . . . . . . . . . . . 2 1.2 Greatest Common Divisors . . . . . . . . . . . . . . . . . . . . 2 1.3 The Euclidean Algorithm . . . . . . . . . . . . . . . . . . . . . 3 1.4 Prime Numbers . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.5 The Fundamental Theorem of Arithmetic . . . . . . . . . . . . 5 1.6 The Infini...
متن کاملCommon Fixed Point Theory in Modified Intuitionistic Probabilistic Metric Spaces with Common Property (E.A.)
In this paper, we define the concepts of modified intuitionistic probabilistic metric spaces, the property (E.A.) and the common property (E.A.) in modified intuitionistic probabilistic metric spaces.Then, by the commonproperty (E.A.), we prove some common fixed point theorems in modified intuitionistic Menger probabilistic metric spaces satisfying an implicit relation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1977